Placing observers to cover a polyhedral terrain in polynomial time
نویسندگان
چکیده
The Art Gallery Problem is the problem of determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem is well known and has a linear solution for the 2 dimensional case, but little is known in the 3-D case. In this paper we present a polynomial time solution for the 3-D version of the Art Gallery Problem. Because the problem is NP-hard, the solution presented is an approximation, and we present the bounds to our solution. Our solution uses techniques from Computational Geometry, Graph Coloring and Set Coverage. A complexity analysis is presented for each step and an analysis of the overall quality of the solution is given.
منابع مشابه
A System to Place Observers in a Polyhedral Terrain in Polynomial Time ?
The Art Gallery Problem is the problem of determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem is well known and has a linear solution for the 2 dimensional case, but little is known in the 3-D case. In this paper we present a polynomial time solution for the 3-D version of the Art Gallery Problem. Becaus...
متن کاملA system to place observers on a polyhedral terrain in polynomial time
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem is well known and has a linear time solution for the 2 dimensional case, but little is known in the 3-D case. In this paper we present a polynomial time solution for the 3-D version of the Art Gallery Problem. Because ...
متن کاملGuarding Polyhedral Terrains
We prove that [n/2J vertex guards are always sufficient and sometimes necessary to guard the surface of an n-vertex polyhedral terrain. We also show that l(4n 4)/13J edge guards are sometimes necessary to guard the surface of an n-vertex polyhedral terrain. The upper bound on the number of edge guards is ln/3J (Everett and Rivera-Campo, 1994). Since both upper bounds are based on the four color...
متن کاملEfficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain
We present eecient polynomial time algorithms that place bn=2c vertex guards which cover the surface of an n-vertex polyhedral terrain, and similarly, bn=3c edge guards which cover the surface of an n-vertex polyhedral terrain. The time complexity of both algorithms, dominated by the cost of nding a maximum matching in a graph, is O(n 3=2).
متن کاملFlying over a polyhedral terrain
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p ≥ 1, computes a (c + ε)approximation to the Lp-shortest path above a polyhedral terrain in O( ε log n log log n) time and O(n log n) space, where n is the number of vertices of the terrain, and c = 2(p−1)/p. This leads to a F...
متن کامل